Improved approximation algorithms for minimum power covering problems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Partial Covering Problems
We study a generalization of covering problems called partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example, in k-partial set cover, we wish to choose a minimum number of sets to cover at least k elements. For k-partial set cover, if each element occurs in at most f sets, then we derive a primal...
متن کاملCS 583: Approximation Algorithms: Covering Problems∗
Packing and Covering problems together capture many important problems in combinatorial optimization. We will consider covering problems in these notes. Two canonical covering problems are Vertex Cover and its generalization Set Cover. They play an important role in the study of approximation algorithms. A vertex cover of a graph G = (V,E) is a set S ⊆ V such that for each edge e ∈ E, at least ...
متن کاملApproximation Algorithms for Geometric Covering Problems for Disks and Squares
Geometric covering is a well-studied topic in computational geometry. We study three covering problems: Disjoint Unit-Disk Cover, Depth-(≤ K) Packing and Red-Blue UnitSquare Cover. In the Disjoint Unit-Disk Cover problem, we are given a point set and want to cover the maximum number of points using disjoint unit disks. We prove that the problem is NP-complete and give a polynomial-time approxim...
متن کاملImproved Approximation Algorithms for Unsplittable Flow Problems
In the single-source unsplittable ow problem we are given a graph G; a source vertex s and a set of sinks t 1 ; : : :; t k with associated demands. We seek a single s-t i ow path for each commodity i so that the demands are satissed and the total ow routed across any edge e is bounded by its capacity c e : The problem is an NP-hard variant of max ow and a generalization of single-source edge-di...
متن کاملImproved Approximation Algorithms for Balanced Partitioning Problems
We present approximation algorithms for balanced partitioning problems. These problems are notoriously hard and we present new bicriteria approximation algorithms, that approximate the optimal cost and relax the balance constraint. In the first scenario, we consider Min-Max k-Partitioning, the problem of dividing a graph into k equal-sized parts while minimizing the maximum cost of edges cut by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.07.010